Unique low rank completability of partially filled matrices
نویسندگان
چکیده
We consider the problems of completing a low-rank positive semidefinite square matrix M or a low-rank rectangular matrix N from a given subset of their entries. We study the local and global uniqueness of such completions by analysing the structure of the graphs determined by the positions of the known entries of M or N . We show that the unique completability testing of rectangular matrices is a special case of the unique completability testing of positive semidefinite matrices. We prove that a generic partially filled matrix is globally uniquely completable if any principal minor of size n − 1 is locally uniquely completable. These results are based on new geometric observations that extend similar results of the theory of rigid frameworks. We also give an example showing that global completability is not a generic property in R2. We provide sufficient conditions for two-dimensional local and global unique completability of an n× n matrix by proving tight lower (resp. upper) bounds on the minimum number of known entries per row (on the total number of unknown entries, resp.) as a function of n.
منابع مشابه
Combinatorial Conditions for the Unique Completability of Low-Rank Matrices
We consider the problems of completing a low-rank positive semidefinite square matrix M or a low-rank rectangular matrix N from a given subset of their entries. Following the approach initiated by Singer and Cucuringu [20] we study the local and global uniqueness of such completions by analysing the structure of the graphs determined by the positions of the known entries of M or N . We present ...
متن کاملA Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completion
Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An incomplete d ×N matrix is finitely rank-r completable if there are at most finitely many rank-r matrices that agree with all its observed entries. Finite com...
متن کاملCharacterization of Deterministic and Probabilistic Sampling Patterns for Finite Completability of Low Tensor-Train Rank Tensor
In this paper, we analyze the fundamental conditions for low-rank tensor completion given the separation or tensor-train (TT) rank, i.e., ranks of unfoldings. We exploit the algebraic structure of the TT decomposition to obtain the deterministic necessary and sufficient conditions on the locations of the samples to ensure finite completability. Specifically, we propose an algebraic geometric an...
متن کاملFundamental Conditions for Low-CP-Rank Tensor Completion
We consider the problem of low canonical polyadic (CP) rank tensor completion. A completion is a tensor whose entries agree with the observed entries and its rank matches the given CP rank. We analyze the manifold structure corresponding to the tensors with the given rank and define a set of polynomials based on the sampling pattern and CP decomposition. Then, we show that finite completability...
متن کاملDeterministic and Probabilistic Conditions for Finite Completability of Low-rank Multi-View Data
We consider the multi-view data completion problem, i.e., to complete a matrix U = [U1|U2] where the ranks of U,U1, and U2 are given. In particular, we investigate the fundamental conditions on the sampling pattern, i.e., locations of the sampled entries for finite completability of such a multi-view data given the corresponding rank constraints. In contrast with the existing analysis on Grassm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 121 شماره
صفحات -
تاریخ انتشار 2016